Remarks on regulated limited ETOL systems and regulated context-free grammars
نویسندگان
چکیده
منابع مشابه
Remarks on Regulated Limited ET0L Systems and Regulated Context-Free Grammars
We continue the studies of the second author on regulated uniformly k-limited and regulated k-limited ET0L systems. We focus on the permitting and forbidding random context regulation. Especially, we establish some results on (regulated) propagating (uniformly) k-limited ET0L systems which were not solved in 2, 18, 21, 22]. Moreover, relations to recurrent programmed languages introduced by von...
متن کاملRemarks on Propagating Partition-Limited ETOL Systems
In this paper, we sharpen the results of G artner on the universality of partition-limited ET0L systems by showing that such deterministic systems characterize the recursively enumerable sets, and, furthermore, the propagating deterministic partition-limited ET0L systems characterize the programmed languages with appearance checking disallowing erasing productions. The main results of this pap...
متن کاملon the relationship between self- regulated learning strategies use and willingness to communicate in the context of writing
این تحقیق به منظور بررسی رابطه بین میزان استراتژیهای خود-تنظیم شده یادگیری و تمایل به ایجاد ارتباط دانشجویان زبان انگلیسی انجام شده است.علاوه بر این،روابط و کنش های موجود بین ریزسنجه های استراتژیهای خود-تنظیم شده یادگُیری ، مهارت نگارش و تمایل به برقراری ارتباط و همچنین تاٍثیرجنسیت دانشجویان زبان انگلیسی در استراتژیهای خود-تنظیم شده یادگیری و تمایل به برقراری ارتباط آنها مورد بررسی قرار گرفته شد.
15 صفحه اولGrammars with Regulated Rewriting
Context-free grammars are not able to cover all linguistic phenomena. Thus we define some types of grammars where context-free rules are used and restriction imposed on the derivations. We illustrate the concepts by example, compare the generative power, give some closure and decidability properties and basic facts on syntactic complexity.
متن کاملA Note on the Generative Power of Some Simple Variants of Context-Free Grammars Regulated by Context Conditions
This paper answers three open questions concerning the generative power of some simple variants of context-free grammars regulated by context conditions. Specifically, it discusses the generative power of so-called contextfree semi-conditional grammars (which are random context grammars where permitting and forbidding sets are replaced with permitting and forbidding strings) where permitting an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1998
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(96)00329-5